User - De ned Aggregates in Database

نویسنده

  • Haixun Wang
چکیده

User-deened aggregates can be the linchpin of sophisticated datamining functions and other advanced database applications , but they nd little support in current database systems including Object-Relational databases. Three serious limitations of current databases are (i) the inability of introducing new aggregates (e.g., by coding them in a procedural language as proposed in SQL3), (ii) the inability of returning partial results during computation (e.g., to support online aggregation), and (iii) the inability of using aggregates in recursive queries|e.g., to express Bill of Materials (BoM) applications and optimized graph searches. This paper proposes a uniied solution to these problems, and discusses practical and theoretical aspects of this powerful addition to database languages.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

User - De ned Aggregates for DataminingHaixun

User-deened aggregates can be the linchpin of sophisticated datamining functions and other advanced database applications. This is demonstrated by our eecient implementation on DB2 of SQL3 user-deened aggregates extended with early returns, which we have used to implement several data mining algorithms. Aggregates with early returns are monotonic and can thus be used freely in recursive queries.

متن کامل

Data Models and Query Languages of Spatio-temporal Information

of the Dissertation Data Models and Query Languages of Spatio-Temporal Information by Cindy Xinmin Chen Doctor of Philosophy in Computer Science University of California, Los Angeles, 2001 Professor Carlo Zaniolo, Chair In this dissertation, we extend database models and query languages to support spatio-temporal information, including representations for changing positions and shapes. Furtherm...

متن کامل

Database System Extensions for Decision Support: the AXL Approach

Research on database-centric data mining is seeking to improve the e ectiveness of database systems in decision support applications. Di erent solutions are now used for di erent problems, including (i) SQL extensions for more complex OLAP queries, (ii) new datablades for special data types such as time-series, and (iii) architectural extensions to support data mining functions. Here, we propos...

متن کامل

Optimization of Queries with User-deened Predicates

Relational databases provide the ability to store user-de ned functions and predicates which can be invoked in SQL queries. When evaluation of a user-de ned predicate is relatively expensive, the traditional method of evaluating predicates as early as possible is no longer a sound heuristic. There are two previous approaches for optimizing such queries. However, none of these approaches is able...

متن کامل

Foundations of Aggregation in Deductive Databases

As a foundation for providing semantics for aggregation within recursion, the structure of subsets of partially ordered domains is studied. We argue that the underlying cause of many of the di culties encountered in extending deductive database semantics to include aggregation is that set construction does not preserve the structure of the underlying domain very well. We study a binary relation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999